43 research outputs found
Geometric Crossing-Minimization - A Scalable Randomized Approach
We consider the minimization of edge-crossings in geometric drawings of graphs G=(V, E), i.e., in drawings where each edge is depicted as a line segment. The respective decision problem is NP-hard [Daniel Bienstock, 1991]. Crossing-minimization, in general, is a popular theoretical research topic; see Vrt\u27o [Imrich Vrt\u27o, 2014]. In contrast to theory and the topological setting, the geometric setting did not receive a lot of attention in practice. Prior work [Marcel Radermacher et al., 2018] is limited to the crossing-minimization in geometric graphs with less than 200 edges. The described heuristics base on the primitive operation of moving a single vertex v to its crossing-minimal position, i.e., the position in R^2 that minimizes the number of crossings on edges incident to v.
In this paper, we introduce a technique to speed-up the computation by a factor of 20. This is necessary but not sufficient to cope with graphs with a few thousand edges. In order to handle larger graphs, we drop the condition that each vertex v has to be moved to its crossing-minimal position and compute a position that is only optimal with respect to a small random subset of the edges. In our theoretical contribution, we consider drawings that contain for each edge uv in E and each position p in R^2 for v o(|E|) crossings. In this case, we prove that with a random subset of the edges of size Theta(k log k) the co-crossing number of a degree-k vertex v, i.e., the number of edge pairs uv in E, e in E that do not cross, can be approximated by an arbitrary but fixed factor delta with high probability. In our experimental evaluation, we show that the randomized approach reduces the number of crossings in graphs with up to 13 000 edges considerably. The evaluation suggests that depending on the degree-distribution different strategies result in the fewest number of crossings
Evolution and Evaluation of the Penalty Method for Alternative Graphs
Computing meaningful alternative routes in a road network is a complex problem -- already giving a clear definition of a best alternative seems to be impossible. Still, multiple methods describe how to compute reasonable alternative routes, each according to their own quality criteria. Among these methods, the penalty method has received much less attention than the via-node or plateaux based approaches. A mayor cause for the lack of interest might be the unavailability of an efficient implementation. In this paper, we
take a closer look at the penalty method and extend upon its ideas. We provide the first viable implementation --suitable for interactive use-- using dynamic runtime adjustments to perform up to multiple orders of magnitude faster queries than previous implementations. Using our new implementation, we thoroughly evaluate the penalty method for its flaws and benefits
Multilevel Planarity
In this paper, we introduce and study multilevel planarity, a generalization of upward planarity and level planarity. Let be a directed graph and let be a function that assigns a finite set of integers to each vertex. A multilevel-planar drawing of is a planar drawing of such that for each vertex its -coordinate is in , nd each edge is drawn as a strictly -monotone curve. We present linear-time algorithms for testing multilevel planarity of embedded graphs with a single source and of oriented cycles. Complementing these algorithmic results, we show that multilevel-planarity testing is NP-complete even in very restricted cases
Hard color-singlet exchange in dijet events in proton-proton collisions at root s=13 TeV
Events where the two leading jets are separated by a pseudorapidity interval devoid of particle activity, known as jet-gap-jet events, are studied in proton-proton collisions at root s = 13 TeV. The signature is expected from hard color-singlet exchange. Each of the highest transverse momentum (p(T)) jets must have p(T)(jet) > 40 GeV and pseudorapidity 1.4 0.2 GeV in the interval vertical bar eta vertical bar < 1 between the jets are observed in excess of calculations that assume only color-exchange. The fraction of events produced via color-singlet exchange, f(CSE), is measured as a function of p(T)(jet2), the pseudorapidity difference between the two leading jets, and the azimuthal angular separation between the two leading jets. The fraction f(CSE) has values of 0.4-1.0%. The results are compared with previous measurements and with predictions from perturbative quantum chromodynamics. In addition, the first study of jet-gap-jet events detected in association with an intact proton using a subsample of events with an integrated luminosity of 0.40 pb(-1) is presented. The intact protons are detected with the Roman pot detectors of the TOTEM experiment. The f(CSE) in this sample is 2.91 +/- 0.70(stat)(-1.01)(+1.08)(syst) times larger than that for inclusive dijet production in dijets with similar kinematics.Peer reviewe
Aligned Drawings of Planar Graphs
Let G be a graph embedded in the plane and let A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and A is a planar polyline drawing Γ of G with an arrangement A of lines so that Γ and A are homeomorphic to G and A. We show that if A is stretchable and every edge e either entirely lies on a pseudoline or intersects at most one pseudoline, then G and A have a straight-line aligned drawing. In order to prove these results, we strengthen the result of Da Lozzo et al. [5], and prove that a planar graph G and a single pseudoline L have an aligned drawing with a prescribed convex drawing of the outer face. We also study the more general version of the problem where only a set of vertices is given and we need to determine whether they can be collinear. We show that the problem is NP-hard but fixed-parameter tractable